A 2O(k)poly(n) algorithm for the parameterized Convex Recoloring problem
نویسنده
چکیده
In this paper we present a parameterized algorithm that solves the Convex Recoloring problem for trees in O(256k ∗ poly(n)). This improves the currently best upper bound of O(k(k/ log k)k ∗ poly(n)) achieved by Moran and Snir. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Faster Deterministic Volume Estimation in the Oracle Model via Thin Lattice Coverings
We give a 2O(n)(1+1/ε)n time and poly(n)-space deterministic algorithm for computing a (1+ε) approximation to the volume of a general convex body K, which comes close to matching the (1+c/ε)n/2 lower bound for volume estimation in the oracle model by Bárány and Füredi (STOC 1986, Proc. Amer. Math. Soc. 1988). This improves on the previous results of Dadush and Vempala (Proc. Nat’l Acad. Sci. 20...
متن کاملParameterized Low-Rank Binary Matrix Approximation
We provide a number of algorithmic results for the following family of problems: For a given binary m × n matrix A and integer k, decide whether there is a “simple” binary matrix B which differs from A in at most k entries. For an integer r, the “simplicity” of B is characterized as follows. • Binary r-Means: Matrix B has at most r different columns. This problem is known to be NP-complete alre...
متن کاملThe Complexity of Bounded Length Graph Recoloring
We study the following question: Given are two k-colorings α and β of a graph G on n vertices, and integer l. The question is whether α can be modified into β, by recoloring vertices one at a time, while maintaining a k-coloring throughout, and using at most l such recoloring steps. This problem is weakly PSPACE-hard for every constant k ≥ 4. We show that it is also strongly NP-hard for every c...
متن کاملAn O∗(2O(k)) FPT Algorithm for the Undirected Feedback Vertex Set Problem∗
We describe an algorithm for the FEEDBACK VERTEX SET problem on undirected graphs, parameterized by the size k of the feedback vertex set, that runs in time O(ckn3) where c = 10.567 and n is the number of vertices in the graph. This improves on the best previous FPT algorithms due to [RSS02, KPS04] and [RS05] that have running times of the form O ∗(2O(k lg lg ) and O∗(2O(k lg k lg lg k ), respe...
متن کاملSubexponential parameterized algorithm for minimum fill-in
The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. Kaplan, Shamir, and Tarjan [FOCS 1994] have shown that the problem is solvable in time O(2O(k) + knm) on graphs with n vertices and m edges and thus is fixed parameter tractable. Here, we give the first subexponential parameterized algorithm solving Minimum Fillin in time O(2O( √ k log k) + knm). ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 104 شماره
صفحات -
تاریخ انتشار 2007